- infinity lemma
- 无穷性引理
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
infinity lemma
Look at other dictionaries:
König's lemma — or König s infinity lemma is a theorem in graph theory due to Dénes Kőnig (1936). It gives a sufficient condition for an infinite graph to have an infinitely long path. The computability aspects of this theorem have been thoroughly investigated… … Wikipedia
Fatou's lemma — In mathematics, Fatou s lemma establishes an inequality relating the integral (in the sense of Lebesgue) of the limit inferior of a sequence of functions to the limit inferior of integrals of these functions. The lemma is named after the French… … Wikipedia
Riemann-Lebesgue lemma — In mathematics, the Riemann Lebesgue lemma (one of its special cases is also called Mercer s theorem), is of importance in harmonic analysis and asymptotic analysis. It is named after Bernhard Riemann and Henri Lebesgue. The lemma says that the… … Wikipedia
Borel-Cantelli lemma — In probability theory, the Borel Cantelli lemma is a theorem about sequences of events. In a slightly more general form, it is also a result in measure theory. It is named after Émile Borel and Francesco Paolo Cantelli.Let ( E n ) be a sequence… … Wikipedia
Burnside's lemma — Burnside s lemma, sometimes also called Burnside s counting theorem, the Cauchy Frobenius lemma or the orbit counting theorem, is a result in group theory which is often useful in taking account of symmetry when counting mathematical objects. Its … Wikipedia
Jordan's lemma — in complex analysis is a powerful tool used frequently when evaluating contour integrals, and real integrals from ∞ to +∞.Consider a function of the form: ::f(z)=e^{iaz} g(z),Jordan s Lemma states that::lim {R o infty} int {C 1} f(z), dz = 0 quad … Wikipedia
Kronecker's lemma — In mathematics, Kronecker s lemma is a result about the relationship between convergence of infinite sums and convergence of sequences. The lemma is often used as part of the proofs concerning theorems concerning sums of independent random… … Wikipedia
Estimation lemma — In mathematics, the estimation lemma gives an upper bound for a contour integral. If f is a complex valued, continuous function on the contour Gamma and if its absolute value | f ( z )| is bounded by a constant M for all z on Gamma, then:left|int … Wikipedia
Hartogs' lemma — Note: Terminology is quite confused: Hartogs lemma sometimes refers to Hartogs result on the Hartogs number, while Hartogs theorem often refers to this result. In mathematics, Hartogs lemma is a fundamental result on several complex variables,… … Wikipedia
De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… … Wikipedia
Garden of Eden (cellular automaton) — An orphan pattern in Conway s Game of Life, discovered by R. Banks in 1971.[1] … Wikipedia
